/*
自己选择的路 ,跪着也要走完。朋友们 , 虽然这个世界日益浮躁起来,只
要能够为了当时纯粹的梦想和感动坚持努力下去 , 不管其它人怎么样,我
们也能够保持自己的本色走下去。
To the world , you will be a person , but to a person , you
will be the world .                               ——AKPower
*/
#include <iostream>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <vector>
#include <map>
#include <queue>
#include <cstdio>
#include <string>
#include <stack>
#include <set>
#define IOS ios::sync_with_stdio(false), cin.tie(0)
using namespace std;
typedef long long ll;
struct node
{
    ll id, val;
    friend bool operator<(const node &a, const node &b)
    {
        if(a.val==b.val){
            return a.id>b.id;
        }
        return a.val < b.val;
    }
};
priority_queue<node> p[3];

int main()
{
    IOS;
    ll n;
    string s;
    ll x, y;
    while (cin >> n)
    {
        ll cnt=0;
        while (n--)
        {
            cin >> s;
            if (s == "IN")
            {
                cin >> x >> y;
                node t;
                t.id =++cnt;
                t.val = y;
                p[x - 1].push(t);
            }
            else
            {
                cin >> x;
                if (!p[x - 1].empty())
                {
                    node t = p[x - 1].top();
                    p[x - 1].pop();
                    cout << t.id << endl;
                }
                else
                {
                    cout << "EMPTY" << endl;
                }
            }
        }
        for(ll i=0;i<3;i++){
            while(!p[i].empty())p[i].pop();
        }
    }
    getchar();
    getchar();
    return 0;
}
